Upper and lower bounds on FSM switching activity
نویسندگان
چکیده
This paper obtains upper and lower bounds for the switching activity on the state lines of a finite state machine (FSM) that is driven with typical input sequences. By exploiting the symmetries between the Hamming distances of state encodings, we obtain tight bounds on the average Hamming distance, which is proportional to the average switching activity and the overall power dissipation of the system. Since these bounds are independent of the state assignment and the actual circuit implementation, they can be used at an early stage of the FSM design to indicate the largest/smallest possible power consumption. The paper also discusses how redundant state encodings can be chosen to decrease power consumption.
منابع مشابه
Bounds on FSM Switching Activity
This paper obtains lower and upper bounds for the switching activity on the state lines of a finite state machine (FSM) that is driven with typical input sequences. More specifically, the paper bounds the average Hamming distance which is in turn proportional to the switching activity and the overall power dissipation of the system. By introducing the concepts of a distance matrix and a weight ...
متن کاملComputation of Lower and Upper Bounds for Switching Activity: A Unified Approach
Accurate switching activity estimation is crucial for power budgeting. It is impractical to obtain an accurate estimate by simulating the circuit for all possible inputs. An alternate approach would be to compute tight bounds for the switching activity. In this paper, we propose a non-simulative method to compute bounds for switching activity at the logic level. First, we show that the switchin...
متن کاملUpper and lower bounds of symmetric division deg index
Symmetric Division Deg index is one of the 148 discrete Adriatic indices that showed good predictive properties on the testing sets provided by International Academy of Mathematical Chemistry. Symmetric Division Deg index is defined by $$ SDD(G) = sumE left( frac{min{d_u,d_v}}{max{d_u,d_v}} + frac{max{d_u,d_v}}{min{d_u,d_v}} right), $$ where $d_i$ is the degree of vertex $i$ in graph $G$. In th...
متن کاملEstimating Upper and Lower Bounds For Industry Efficiency With Unknown Technology
With a brief review of the studies on the industry in Data Envelopment Analysis (DEA) framework, the present paper proposes inner and outer technologies when only some basic information is available about the technology. Furthermore, applying Linear Programming techniques, it also determines lower and upper bounds for directional distance function (DDF) measure, overall and allocative efficienc...
متن کامل